Products of Many Sorted Algebras

نویسنده

  • Beata Madras
چکیده

For simplicity we follow the rules: I, J denote sets, A, B denote many sorted sets of I, i, j, x are arbitrary, and S denotes a non empty many sorted signature. A set has common domain if: (Def.1) For all functions f , g such that f ∈ it and g ∈ it holds dom f = dom g. Let us mention that there exists a set which is functional and non empty and has common domain. The following proposition is true (1) {∅} is a functional set with common domain. Let X be a functional set with common domain. The functor DOM(X) yielding a set is defined as follows: (Def.2) (i) For every function x such that x ∈ X holds DOM(X) = domx if X 6= ∅, (ii) DOM(X) = ∅, otherwise. We now state the proposition (2) For every functional set X with common domain such that X = {∅} holds DOM(X) = ∅.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on Products of Many Sorted Algebras

This article is continuation of an article defining products of many sorted algebras [11]. Some properties of notions such as commute, Frege, Args() are shown in this article. Notions of constant of operations in many sorted algebras and projection of products of family of many sorted algebras are defined. There is also introduced the notion of class of family of many sorted algebras. The main ...

متن کامل

Many Sorted Algebras

The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between (1 sorted) universal algebras [8] and many sorted algebras with one sort only is described by introducing ...

متن کامل

A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras

Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...

متن کامل

Hiding and Behaviour: an Institutional Approach

Theories with hidden sorts provide a setting to study the idea of behaviour and behavioural equivalence of elements. But there are variants on the notion of theory: many sorted algebras, order sorted algebras and so on; we would like to use the theory of institutions to develop ideas of some generality. We formulate the notion of behavioural equivalence in a more abstract and categorical way, a...

متن کامل

Equations in Many Sorted Algebras

This paper is preparation to prove Birkhoff’s Theorem. Some properties of many sorted algebras are proved. The last section of this work shows that every equation valid in a many sorted algebra is also valid in each subalgebra, and each image of it. Moreover for a family of many sorted algebras (Ai : i ∈ I) if every equation is valid in each Ai, i ∈ I then is also valid in product ∏(Ai : i ∈ I).

متن کامل

Preliminaries to Circuits , II 1

This article is the second in a series of four articles (started with [19] and continued in [18], [20]) about modelling circuits by many sorted algebras. First, we introduce some additional terminology for many sorted signatures. The vertices of such signatures are divided into input vertices and inner vertices. A many sorted signature is called circuit like if each sort is a result sort of at ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994